Listing 1 - 3 of 3 |
Sort by
|
Choose an application
This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are based on deep facts from analysis and function theory, such as duality theory and comparison theorems; these are presented in chapters 1 and 3. In keeping with the author's intention to make the book as self-contained as possible, chapter 2 contains an introduction to polynomial and spline approximation. Chapters 4 to 7 apply the theory to specific classes of functions. The last chapter deals with n-widths and generalises some of the ideas of the earlier chapters. Each chapter concludes with commentary, exercises and extensions of results. A substantial bibliography is included. Many of the results collected here have not been gathered together in book form before, so it will be essential reading for approximation theorists.
Approximation theory. --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Approximation theory
Choose an application
Computer science --- Numerical approximation theory --- Approximation theory --- Data processing --- Congresses --- -519.6 --- 681.3*G12 --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- -Congresses --- Computational mathematics. Numerical analysis. Computer programming --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 519.6 --- Data processing&delete& --- Approximation theory - Data processing - Congresses
Choose an application
Chebyshev polynomials. --- 517.518.8 --- 511 --- Chebyshev polynomials --- #KVIV:BB --- 519.6 --- 681.3*G11 --- 681.3*G12 --- Functions, Chebyshev's --- Polynomials, Chebyshev --- Tchebycheff polynomials --- Chebyshev series --- Chebyshev systems --- Orthogonal polynomials --- Approximation of functions by polynomials and their generalizations --- Number theory --- Computational mathematics. Numerical analysis. Computer programming --- Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G11 Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 511 Number theory --- 517.518.8 Approximation of functions by polynomials and their generalizations
Listing 1 - 3 of 3 |
Sort by
|